UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS
نویسندگان
چکیده
منابع مشابه
Unitary-circuit semantics for measurement-based computations
One-way measurement based quantum computations (1WQC) may describe unitary transformations, via a composition of CPTP maps which are not all unitary themselves. This motivates the following decision problems: Is it possible to determine whether a “quantum-to-quantum” 1WQC procedure (having non-trivial input and output subsystems) performs a unitary transformation? Is it possible to describe pre...
متن کاملUniversal gates for non-unitary quantum circuit
Quantum circuit is generalized to include non-unitary gates which are operated by quantum measurement. A 1-qubit non-unitary gate, together with the controlled-NOT gate and the 1-qubit unitary gate, is shown to constitute a universal set of gates for the non-unitary quantum circuit that reduces the number of the overhead of qubits required to ensure fault tolerance. A reversing measurement sche...
متن کاملA non-unitary quantum circuit
The quantum circuit is generalized to include non-unitary gates operated by quantum measurement, in order to reduce the number of the overhead of qubits required to ensure fault tolerance. A specific type of one-qubit non-unitary gates, together with the controlled-not gate and all one-qubit unitary gates, is shown to constitute a universal set of gates for the non-unitary quantum circuit. A re...
متن کاملReducing quantum computations to elementary unitary operations
27 Quantum computing has enormous potential for introducing fundamentally new capabilities to computational science and engineering, primarily through exponential parallelism.1,2 One of the many challenges in building practical quantum computers is to reduce a general quantum computation to some set of elementary operations that simple quantum devices can implement. By analogy, in the case of c...
متن کاملSpace-Efficient Error Reduction for Unitary Quantum Computations
This paper presents a general space-efficient method for error reduction for unitary quantum computation. Consider a polynomial-time quantum computation with completeness c and soundness s, either with or without a witness (corresponding to QMA and BQP, respectively). To convert this computation into a new computation with error at most 2−p, the most space-efficient method known requires extra ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2010
ISSN: 0219-7499,1793-6918
DOI: 10.1142/s0219749910006113